Asymptotic Bound on Binary Self-Orthogonal Codes
نویسنده
چکیده
We present two constructions for binary selforthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R = 1/2, by our constructive lower bound, the relative minimum distance δ ≈ 0.0595 (for GV bound, δ ≈ 0.110). Moreover, we have proved that the binary selforthogonal codes asymptotically achieve the Gilbert-Varshamov bound.
منابع مشابه
A Brief Survey of Self-Dual Codes
This report is a survey of self-dual binary codes. We present the fundamental MacWilliams identity and Gleason’s theorem on self-dual binary codes. We also examine the upper bound of minimum weights of self-dual binary codes using the extremal weight enumerator formula. We describe the shadow code of a self-dual code and the restrictions of the weight enumerator of the shadow code. Then using t...
متن کاملNew asymptotic bounds for self-dual codes and lattices
We give an independent proof of the Krasikov-Litsyn bound d/n . (1−5)/2 on doubly-even self-dual binary codes. The technique used (a refinement of the Mallows-Odlyzko-Sloane approach) extends easily to other families of self-dual codes, modular lattices, and quantum codes; in particular, we show that the Krasikov-Litsyn bound applies to singly-even binary codes, and obtain an analogous bound fo...
متن کاملSelf-Dual Codes better than the Gilbert-Varshamov bound
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$, there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
متن کاملThe combinatorics of LCD codes: linear programming bound and orthogonal matrices
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings Rk. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatoria...
متن کاملNon-binary multithreshold decoders of symbolic self- orthogonal codes for q-ary symmetric channels
Symbolic q-ary multithreshold decoding (qMTD) of q-ary self-orthogonal codes is submitted. It’s shown the BER performance of qMTD is close to the results provided by optimum total search methods, which are not realizable for nonbinary codes in general. New decoders are compared with different decoders of Reed-Solomon codes. The performance provided by non-binary MTD in some cases is unattainabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0804.4194 شماره
صفحات -
تاریخ انتشار 2008